Exploiting Functional Decomposition for Efficient Parallel Processing of Multiple Data Analysis Queries

نویسندگان

  • Henrique Andrade
  • Tahsin M. Kurç
  • Alan Sussman
  • Joel H. Saltz
چکیده

Reuse is a powerful method for improving system performance. In this paper, we examine functional decomposition for improving data reuse and, therefore, overall query execution performance in the context of data analysis applications. Additionally, we look at the performance effects of using various projection primitives that make it possible to transform intermediate results generated during the execution of a previous query so that they can be reused by a new query. A satellite data analysis application is used to experimentally show the performance benefits achieved using these strategies.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evaluation of scheduling solutions in parallel processing using DEA FDH model

This paper gives a new application of DEA to evaluate the scheduling solutions of parallel processing. It evaluates the scheduling solutions of parallel processing using the non-convex DEA model, FDH model. By introducing each solution of parallel processing scheduling as a DMU with some relevant inputs and outputs this paper shows that how the most efficient schedule(s) can be identified.

متن کامل

ارائه روشی پویا جهت پاسخ به پرس‌وجوهای پیوسته تجمّعی اقتضایی

Data Streams are infinite, fast, time-stamp data elements which are received explosively. Generally, these elements need to be processed in an online, real-time way. So, algorithms to process data streams and answer queries on these streams are mostly one-pass. The execution of such algorithms has some challenges such as memory limitation, scheduling, and accuracy of answers. They will be more ...

متن کامل

A hexagonally connected processor array for Jacobi-type matrix algorithms∗

Indexing terms : Parallel algorithms, systolic arrays, matrix computation Jacobi-type matrix algorithms are mostly implemented on orthogonally connected processor arrays. In this letter, an alternative partitioning is described, resulting in a grid of hexagonally connected processors. This partitioning is shown to be over four times more efficient, as compared to the original configuration. Int...

متن کامل

Design and Implementation of a High Speed Systolic Serial Multiplier and Squarer for Long Unsigned Integer Using VHDL

A systolic serial multiplier for unsigned numbers is presented which operates without zero words inserted between successive data words, outputs the full product and has only one clock cycle latency. &#10The multiplier is based on a modified serial/parallel scheme with two adjacent multiplier cells. Systolic concept is a well-known means of intensive computational task through replication of fu...

متن کامل

Design and Implementation of a High Speed Systolic Serial Multiplier and Squarer for Long Unsigned Integer Using VHDL

A systolic serial multiplier for unsigned numbers is presented which operates without zero words inserted between successive data words, outputs the full product and has only one clock cycle latency. The multiplier is based on a modified serial/parallel scheme with two adjacent multiplier cells. Systolic concept is a well-known means of intensive computational task through replication of func...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003